Minimization of Floorplanning Area and Wire Length Interconnection Using Particle Swarm Optimization
نویسنده
چکیده
Floorplanning is an essential design step for hierarchical building module design methodology. Floorplanning provides early feedback that evaluates architectural decisions, estimates chip area, estimates delay and congestion caused by wiring. As technology advances, design complexity is increasing and the circuit size is getting larger. To cope with the increasing design complexity, hierarchical design and Intellectual Property modules are widely used. This makes floorplanning much more critical to the quality of a Very Large Scale Integration (VLSI) design. For many years, floorplanning is a critical step, as it sets up the ground work for a layout. However, it is computationally quite hard. The process of determining block shapes and positions with area minimization objective and aspect ratio requirement is referred to as floorplanning. Common strategy for blocks floorplanning is to determine in the first phase and then the relative location of the blocks to each other based on connection-cost criteria. In the second step, block sizing is performed with the goal of minimizing the overall chip area and the location of each block is finalized. From the computational point of view, VLSI floorplanning is NP-hard. The solution space will increase exponentially with the growth of circuits scale, thus it is difficult to find the optimal solution by exploring the global solution space. To handle this complexity swarm based optimization method has opted in this proposed work. A generalize solution has developed to take care of area as well as interconnection wire length. To achieve this weighted objective function has defined. The advantages of PSO like simplicity in implementation, not depends upon the characteristics of objective function and better performance have given support to include it as a solution method. Keywords— Floorplanning, PSO, Matlab Simulation, Area, Wire length.
منابع مشابه
Performance Analysis of VLSI Floor planning using Evolutionary Algorithm
Floorplanning is an important physical design step for hierarchical, building-block design methodology. When the circuit size get increases the complexity of the circuit also increases. To deal with the increasing design complexity the intellectual property (IP) modules are mostly used in floorplanning. This paper presents a Hybrid particle swarm optimization algorithm for floorplanning optimiz...
متن کاملDiscrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)
Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...
متن کاملBuffer Insertion for Delay Minimization using An Improved PSO Algorithm
This paper considers the problem of interconnect wire delay in digital integrated circuits. The correct wire sizing and buffer insertion/sizing can reduce the interconnect delay. The interconnect wire is divided into segments and to optionally buffers are inserted between two adjacent segments. But it is important to select appropriate values for the size of buffers as well as the lengths and w...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملA particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کامل